Remarks on Privileged Words

نویسندگان

  • Michael Forsyth
  • Amlesh Jayakumar
  • Jarkko Peltomäki
  • Jeffrey Shallit
چکیده

We discuss the notion of privileged word, recently introduced by Peltomäki. A word w is privileged if it is of length ≤ 1, or has a privileged border that occurs exactly twice in w. We prove the following results: (1) if wk is privileged for some k ≥ 1, then wj is privileged for all j ≥ 0; (2) the language of privileged words is neither regular nor context-free; (3) there is a linear-time algorithm to check if a given word is privileged; and (4) there are at least 2n−5/n2 privileged binary words of length n.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Introducing privileged words: Privileged complexity of Sturmian words

In this paper we study the class of so-called privileged wordswhich have been previously considered only a little. We develop the basic properties of privileged words, which turn out to share similar properties with palindromes. Privileged words are studied in relation to previously studied classes of words, rich words, Sturmian words and episturmian words. A new characterization of Sturmian wo...

متن کامل

Closed, Palindromic, Rich, Privileged, Trapezoidal, and Balanced Words in Automatic Sequences

We prove that the property of being closed (resp., rich, privileged trapezoidal, balanced) is expressible in first-order logic for automatic (and some related) sequences. It therefore follows that the characteristic function of those n for which an automatic sequence x has a closed (resp., privileged, rich, trapezoidal, balanced) factor of length n is automatic. For privileged words this requir...

متن کامل

Text Classification and Multilinguism: Getting at Words via N-grams of Characters

Genuine numerical multilingual text classification is almost impossible if only words are treated as the privileged unit of information. Although text tokenization (in which words are considered as tokens) is relatively easy in English or French, it is much more difficult for other languages such as German or Arabic. Moreover, stemming, typically used to normalize and reduce the size of the lex...

متن کامل

Basic self-knowledge and transparency

Cogito-like judgments, a term coined by Burge (1988), comprise thoughts such as, I am now thinking, I [hereby] judge that Los Angeles is at the same latitude as North Africa, or I [hereby] intend to go to the opera tonight. It is widely accepted that we form cogito-like judgments in an authoritative and not merely empirical manner. We have privileged self-knowledge of the mental state that is s...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Int. J. Found. Comput. Sci.

دوره 27  شماره 

صفحات  -

تاریخ انتشار 2016